In this discussion note, we explain how to relax some of the standard assumptions made in Garber-style solutions to the Problem of Old Evidence. The result is a more general and explanatory Bayesian approach.

Corroborating Testimony, Probability and Surprise’, Erik J. Olsson ascribes to L. Jonathan Cohen the claims that if two witnesses provide us with the same information, then the less probable the information is, the more confident we may be that the information is true (C), and the stronger the information is corroborated (C*). We question whether Cohen intends anything like claims (C) and (C*). Furthermore, he discusses the concurrence of witness reports within a context of independent witnesses, whereas the witnesses in (...) Olsson's model are not independent in the standard sense. We argue that there is much more than, in Olsson's words, ‘a grain of truth’ to claim (C), both on his own characterization as well as on Cohen's characterization of the witnesses. We present an analysis for independent witnesses in the contexts of decision-making under risk and decision-making under uncertainty and generalize the model for n witnesses. As to claim (C*), Olsson's argument is contingent on the choice of a particular measure of corroboration and is not robust in the face of alternative measures. Finally, we delimit the set of cases to which Olsson's model is applicable. 1 Claim (C) examined for Olsson's characterization of the relationship between the witnesses 2 Claim (C) examined for two or more independent witnesses 3 Robustness and multiple measures of corroboration 4 Discussion. (shrink)

Book Review of Luc Bovens and Stephan Hartmann *Bayesian Epistemology* by Branden Fitelson.

The conjunction fallacy has been a key topic in debates on the rationality of human reasoning and its limitations. Despite extensive inquiry, however, the attempt of providing a satisfactory account of the phenomenon has proven challenging. Here, we elaborate the suggestion (first discussed by Sides et al., 2001) that in standard conjunction problems the fallacious probability judgments experimentally observed are typically guided by sound assessments of confirmation relations, meant in terms of contemporary Bayesian confirmation theory. Our main formal result is (...) a confirmation-theoretic account of the conjuntion fallacy which is proven robust (i.e., not depending on various alternative ways of measuring degrees of confirmation). The proposed analysis is shown distinct from contentions that the conjunction effect is in fact not a fallacy and is compared with major competing explanations of the phenomenon, including earlier references to a confirmation-theoretic account. (shrink)

McGee argues that it is sometimes reasonable to accept both x and x-> without accepting y->z, and that modus ponens is therefore invalid for natural language indicative conditionals. Here, we examine McGee's counterexamples from a Bayesian perspective. We argue that the counterexamples are genuine insofar as the joint acceptance of x and x-> at time t does not generally imply constraints on the acceptability of y->z at t, but we use the distance-based approach to Bayesian learning to show that applications (...) of modus ponens are nevertheless guaranteed to be successful in an important sense. Roughly, if an agent becomes convinced of the premises of a modus ponens argument, then she should likewise become convinced of the argument's conclusion. Thus we take McGee's counterexamples to disentangle and reveal two distinct ways in which arguments can convince. Any general theory of argumentation must take stock of both. (shrink)

In the course of the 11th century, the economic and demographic growth within the Italian cities and its consequential social problems led to an increasing tension between the aristocratic vassal milieu comprising the bishop on one side and the urban elites on the other. Amongst others, one consequence was the takeover of domination by communal institutions resulting in an independent political participation of the citizens. However, these new communes suffered from a lack of legitimacy. The contemporaries were well aware of (...) the contingency of the communes. The communal discourse as taught in the rhetoric system of the ars dictaminis reveals how domination was conceptualized in the 12th century. (shrink)

forthcoming in M.C. Galavotti, R. Scazzieri and P. Suppes (eds.), Reasoning, Rationality and Probability, Stanford: CSLI Publications 2006.

According to Bayesian confirmation theory, evidence E (incrementally) confirms (or supports) a hypothesis H (roughly) just in case E and H are positively probabilistically correlated (under an appropriate probability function Pr). There are many logically equivalent ways of saying that E and H are correlated under Pr. Surprisingly, this leads to a plethora of non-equivalent quantitative measures of the degree to which E confirms H (under Pr). In fact, many non-equivalent Bayesian measures of the degree to which E confirms (or (...) supports) H have been proposed and defended in the literature on inductive logic. I provide a thorough historical survey of the various proposals, and a detailed discussion of the philosophical ramifications of the differences between them. I argue that the set of candidate measures can be narrowed drastically by just a few intuitive and simple desiderata. In the end, I provide some novel and compelling reasons to think that the correct measure of degree of evidential support (within a Bayesian framework) is the (log) likelihood ratio. The central analyses of this research have had some useful and interesting byproducts, including: (i ) a new Bayesian account of (confirmationally) independent evidence, which has applications to several important problems in con- firmation theory, including the problem of the (confirmational) value of evidential diversity, and (ii ) novel resolutions of several problems in Bayesian confirmation theory, motivated by the use of the (log) likelihood ratio measure, including a reply to the Popper-Miller critique of probabilistic induction, and a new analysis and resolution of the problem of irrelevant conjunction (a.k.a., the tacking problem). (shrink)

According to orthodox (Kolmogorovian) probability theory, conditional probabilities are by definition certain ratios of unconditional probabilities. As a result, orthodox conditional probabilities are undefined whenever their antecedents have zero unconditional probability. This has important ramifications for the notion of probabilistic independence. Traditionally, independence is defined in terms of unconditional probabilities (the factorization of the relevant joint unconditional probabilities). Various “equivalent” formulations of independence can be given using conditional probabilities. But these “equivalences” break down if conditional probabilities are permitted to have (...) conditions with zero unconditional probability. We reconsider probabilistic independence in this more general setting. We argue that a less orthodox but more general (Popperian) theory of conditional probability should be used, and that much of the conventional wisdom about probabilistic independence needs to be rethought. (shrink)

Hempel first introduced the paradox of confirmation in (Hempel 1937). Since then, a very extensive literature on the paradox has evolved (Vranas 2004). Much of this literature can be seen as responding to Hempel’s subsequent discussions and analyses of the paradox in (Hempel 1945). Recently, it was noted that Hempel’s intuitive (and plausible) resolution of the paradox was inconsistent with his official theory of confirmation (Fitelson & Hawthorne 2006). In this article, we will try to explain how this inconsistency (...) affects the historical dialectic about the paradox and how it illuminates the nature of confirmation. In the end, we will argue that Hempel’s intuitions about the paradox of confirmation were (basically) correct, and that it is his theory that should be rejected, in favor of a (broadly) Bayesian account of confirmation. (shrink)

In Chapter 12 of Warrant and Proper Function, Alvin Plantinga constructs two arguments against evolutionary naturalism, which he construes as a conjunction E&N .The hypothesis E says that “human cognitive faculties arose by way of the mechanisms to which contemporary evolutionary thought directs our attention (p.220).”1 With respect to proposition N , Plantinga (p. 270) says “it isn’t easy to say precisely what naturalism is,” but then adds that “crucial to metaphysical naturalism, of course, is the view that there is (...) no such person as the God of traditional theism.” Plantinga tries to cast doubt on the conjunction E&N in two ways.His “preliminary argument” aims to show that the conjunction is probably false, given the fact (R) that our psychological mechanisms for forming beliefs about the world are generally reliable.His “main argument” aims to show that the conjunction E&N is self-defeating — if you believe E&N , then you should stop believing that conjunction.Plantinga further develops the main argument in his unpublished paper “Naturalism Defeated” (Plantinga 1994).We will try to show that both arguments contain serious errors. (shrink)

The Paradox of the Ravens (a.k.a,, The Paradox of Confirmation) is indeed an old chestnut. A great many things have been written and said about this paradox and its implications for the logic of evidential support. The first part of this paper will provide a brief survey of the early history of the paradox. This will include the original formulation of the paradox and the early responses of Hempel, Goodman, and Quine. The second part of the paper will describe attempts (...) to resolve the paradox within a Bayesian framework, and show how to improve upon them. This part begins with a discussion of how probabilistic methods can help to clarify the statement of the paradox itself. And it describes some of the early responses to probabilistic explications. We then inspect the assumptions employed by traditional (canonical) Bayesian approaches to the paradox. These assumptions may appear to be overly strong. So, drawing on weaker assumptions, we formulate a new-and-improved Bayesian confirmation-theoretic resolution of the Paradox of the Ravens. (shrink)

First, a brief historical trace of the developments in confirmation theory leading up to Goodman's infamous "grue" paradox is presented. Then, Goodman's argument is analyzed from both Hempelian and Bayesian perspectives. A guiding analogy is drawn between certain arguments against classical deductive logic, and Goodman's "grue" argument against classical inductive logic. The upshot of this analogy is that the "New Riddle" is not as vexing as many commentators have claimed. Specifically, the analogy reveals an intimate connection between Goodman's problem, and (...) the "problem of old evidence". Several other novel aspects of Goodman's argument are also discussed. (shrink)

Note: This is not an ad hoc change at all. It’s simply the natural thing say here – if one thinks of F as a generalization of classical logical entailment. The extra complexity I had in my original (incorrect) definition of F was there because I was foolishly trying to encode some non-classical, or “relavant” logical structure in F. I now think this is a mistake, and that I should go with the above, classical account of F. Arguments about relevance (...) logic need to be handled in a different way (and a different context!). And, besides, as Luca Moretti has shown (see below), the original definition of F cannot be the right basis for C ! OK, now on to C. (shrink)

Naive deductive accounts of confirmation have the undesirable consequence that if E confirms H, then E also confirms the conjunction H & X, for any X—even if X is utterly irrelevant to H (and E). Bayesian accounts of confirmation also have this property (in the case of deductive evidence). Several Bayesians have attempted to soften the impact of this fact by arguing that—according to Bayesian accounts of confirmation— E will confirm the conjunction H & X less strongly than E confirms (...) H (again, in the case of deductive evidence). I argue that existing Bayesian “resolutions” of this problem are inadequate in several important respects. In the end, I suggest a new‐and‐improved Bayesian account (and understanding) of the problem of irrelevant conjunction. (shrink)

Carnap's inductive logic (or confirmation) project is revisited from an "increase in firmness" (or probabilistic relevance) point of view. It is argued that Carnap's main desiderata can be satisfied in this setting, without the need for a theory of "logical probability." The emphasis here will be on explaining how Carnap's epistemological desiderata for inductive logic will need to be modified in this new setting. The key move is to abandon Carnap's goal of bridging confirmation and credence, in favor of bridging (...) confirmation and evidential support. (shrink)

As every philosopher knows, “the design argument” concludes that God exists from premisses that cite the adaptive complexity of organisms or the lawfulness and orderliness of the whole universe. Since 1859, it has formed the intellectual heart of creationist opposition to the Darwinian hypothesis that organisms evolved their adaptive features by the mindless process of natural selection. Although the design argument developed as a defense of theism, the logic of the argument in fact encompasses a larger set of issues. William (...) Paley saw clearly that we sometimes have an excellent reason to postulate the existence of an intelligent designer. If we find a watch on the heath, we reasonably infer that it was produced by an intelligent watchmaker. This design argument makes perfect sense. Why is it any different to claim that the eye was produced by an intelligent designer? Both critics and defenders of the design argument need to understand what the ground rules are for inferring that an intelligent designer is the unseen cause of an observed effect. (shrink)

In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in PROVER9 (a first-order automated reasoning system which is the successor to OTTER). After reviewing the second-order, axiomatic theory of abstract objects, we show (1) how to represent a fragment of that theory in PROVER9's first-order syntax, and (2) how (...) PROVER9 then finds proofs of interesting theorems of metaphysics, such as that every possible world is maximal. We conclude the paper by discussing some issues for further research. (shrink)

There are two central questions concerning probability. First, what are its formal features? That is a mathematical question, to which there is a standard, widely (though not universally) agreed upon answer. This answer is reviewed in the next section. Second, what sorts of things are probabilities---what, that is, is the subject matter of probability theory? This is a philosophical question, and while the mathematical theory of probability certainly bears on it, the answer must come from elsewhere. To see why, observe (...) that there are many things in the world that have the mathematical structure of probabilities---the set of measurable regions on the surface of a table, for example---but that one would never mistake for being probabilities. So probability is distinguished by more than just its formal characteristics. The bulk of this essay will be taken up with the central question of what this “more” might be. (shrink)

Bayesianism provides a rich theoretical framework, which lends itself rather naturally to the explication of various “contrastive” and “non-contrastive” concepts. In this (brief) discussion, I will focus on issues involving “contrastivism”, as they arise in some of the recent philosophy of science, epistemology, and cognitive science literature surrounding Bayesian confirmation theory.

In applying Bayes’s theorem to the history of science, Bayesians sometimes assume – often without argument – that they can safely ignore very implausible theories. This assumption is false, both in that it can seriously distort the history of science as well as the mathematics and the applicability of Bayes’s theorem. There are intuitively very plausible counter-examples. In fact, one can ignore very implausible or unknown theories only if at least one of two conditions is satisfied: (i) one is certain (...) that there are no unknown theories which explain the phenomenon in question, or (ii) the likelihood of at least one of the known theories used in the calculation of the posterior is reasonably large. Often in the history of science, a very surprising phenomenon is observed, and neither of these criteria is satisfied. (shrink)

In these brief remarks, I describe the author’s Bayesian explication of the narrow function of the meta-cognitive, heuristic algorithm (pbs) that is at the heart of his psychological explanation of why we entertain skeptical doubts. I provide some critical remarks, and an alternative Bayesian approach that is (to my mind) somewhat more elegant than the author’s.

The Paradox of the Ravens (a.k.a,, The Paradox of Confirmation) is indeed an old chestnut. A great many things have been written and said about this paradox and its implications for the logic of evidential support. The first part of this paper will provide a brief survey of the early history of the paradox. This will include the original formulation of the paradox and the early responses of Hempel, Goodman, and Quine. The second part of the paper will describe attempts (...) to resolve the paradox within a Bayesian framework, and show how to improve upon them. This part begins with a discussion of how probabilistic methods can help to clarify the statement of the paradox itself. And it describes some of the early responses to probabilistic explications. We then inspect the assumptions employed by traditional (canonical) Bayesian approaches to the paradox. These assumptions may appear to be overly strong. So, drawing on weaker assumptions, we formulate a new-and-improved Bayesian confirmation-theoretic resolution of the Paradox of the Ravens. (shrink)

This is a high quality, concise collection of articles on the foundations of probability and statistics. Its editor, Richard Swinburne, has collected five papers by contemporary leaders in the field, written a pretty thorough and even-handed introductory essay, and placed a very clean and accessible version of Reverend Thomas Bayes’s famous essay (“An Essay Towards the Solving a Problem in the Doctrine of Chances”) at the end, as an Appendix (with a brief historical introduction by the noted statistician G.A. Barnard). (...) I will briefly discuss each of the five papers in the volume, with an emphasis on certain issues arising from the use of probability as a tool for thinking about evidence. (shrink)

There are various questions that arise in connection with the “intelligent design” (ID) controversy. This introductory section aims to distinguish five of these questions. Later sections are devoted to detailed discussions of each of these five questions. The first (and central) question is the one that has been discussed most frequently in the news lately: (Q1) Should ID be taught in our public schools? It is helpful to break this general “public school curriculum question” into the following two more specific (...) sub-questions: (Q1.1) Should ID be included in the science curriculum of our public schools? (Q1.2) Should ID be included in some part of our public school curriculum? Of course, these public school curriculum questions should be distinguished from other (perhaps related, but distinct) questions that are often asked about ID. Here is another question that is very frequently discussed, not only in the debate about (Q1), but in the ID controversy generally: (Q2) What is ID? In other words, is ID a scientific theory, a religious doctrine, an.. (shrink)

This article features long-sought proofs with intriguing properties (such as the absence of double negation and the avoidance of lemmas that appeared to be indispensable), and it features the automated methods for finding them. The theorems of concern are taken from various areas of logic that include two-valued sentential (or propositional) calculus and infinite-valued sentential calculus. Many of the proofs (in effect) answer questions that had remained open for decades, questions focusing on axiomatic proofs. The approaches we take are of (...) added interest in that all rely heavily on the use of a single program that offers logical reasoning, William McCune's automated reasoning program OTTER. The nature of the successes and approaches suggests that this program offers researchers a valuable automated assistant. This article has three main components. First, in view of the interdisciplinary nature of the audience, we discuss the means for using the program in question (OTTER), which flags, parameters, and lists have which effects, and how the proofs it finds are easily read. Second, because of the variety of proofs that we have found and their significance, we discuss them in a manner that permits comparison with the literature. Among those proofs, we offer a proof shorter than that given by Meredith and Prior in their treatment of ukasiewicz's shortest single axiom for the implicational fragment of two-valued sentential calculus, and we offer a proof for the ukasiewicz 23-letter single axiom for the full calculus. Third, with the intent of producing a fruitful dialogue, we pose questions concerning the properties of proofs and, even more pressing, invite questions similar to those this article answers. (shrink)

Popper [3] offers a qualitative definition of the relation “p q” = “p is (strictly) closer to the truth than (i.e., strictly more verisimilar than) q”, using the notions of truth (in the actual world) and classical logical consequence ( ), as follows.

• What are the ends of statistical experiment, analysis, and inference? • What are the most effective means for achieving these ends? • Several paradigms for statistics have been developed — each of these presupposes answers to these key “philosophical” questions about statistics.

This talk is (mainly) about the relationship two types of epistemic norms: accuracy norms and coherence norms. A simple example that everyone will be familiar with.

To be honest, I have almost nothing critical to say about Jim’s presentation (and this is quite unusual for a cranky analytic philosopher like me!). What Jim has said is all very sensible, and his examples are very well chosen, etc. So, instead of making critical remarks, I will try to expand a little on one of the themes Jim briefly touched upon in his talk: the contextuality of probability.

Slide #0 (Title). Before I get underway, I’d like to quickly thank a few people. First, Jonathan Vogel and John MacFarlane for working behind the scenes to make this thing happen. And, of course, David Christensen for chairing, and Patrick Maher and Jim Joyce for participating. I especially want to thank Patrick for his terrific feedback on my work this term, which has helped me to get much clearer on my project. Before we get started, does everyone have a handout? (...) The handout contains all the slides I will be going through. That’s almost everything I’m going to say. The script from which I am reading today will only occasionally embellish what’s written on the slides (like right now, for instance). OK, now onto today’s agenda. (shrink)

Harman [8] would concede that (1)–(3) are inconsistent, and (as a result) that something is wrong with premises (1)–(3). But, he would reject the relevantists’ diagnosis that (1) must be rejected. I take it he’d say it’s (2) that is to blame here. (2) is a bridge principle [12] linking entailment and inference. (2) is correct only for consistent B’s. [Even if B is consistent, the correct response may rather be to reject some Bi’s in B.].

Carnap [1] aims to provide a formal explication of an informal concept (relation) he calls “confirmation”. He clarifies “E confirms H” in various ways, including: (∗) E provides some positive evidential support for H. His formal explication of “E confirms H” (in [1]) is: (1) E confirms H iff Pr(H | E) > r, where Pr is a suitable (“logical”) probability function, and r is a threshold value.

It is useful to note how (CC) differs from closure: (C) If S comes to believe q solely on the basis of competent deduction from p and S knows that p, then S knows that q. I won’t be discussing (C) today, but here is a useful contrast.

Let L be a sentential (object) language containing atoms ‘A’, ‘B’, . . . , and two logical connectives ‘&’ and ‘→’. In addition to these two logical connectives, L will also contain another binary connective ‘ ’, which is intended to be interpreted as the English indicative. In the meta-language for L , we will have two meta-linguistic operations: ‘ ’ and ‘ ’. ‘ ’ is a binary relation between individual sentences in L . It will be interpreted (...) as “single premise entailment” (or “single premise deducibility in L ”). ‘ ’ is a monadic predicate on sentences of L . It will be interpreted as “logical truth of the logic of L ” (or “theorem of the logic of L ”). We will not presuppose anything about the relationship between ‘ ’ and ‘ ’. Rather, we will state explicitly all assumptions about these meta-theoretic relations that will be required for Gibbard’s Theorem. (shrink)

Intuitively, it seems that S 1 is “more random” or “less regular” than S 2. In other words, it seems more plausible (in some sense) that S 1 (as opposed to S 2) was generated by a random process ( e.g. , by tossing a fair coin eight times, and recording an H for a heads outcome and a T for a tails outcome). We will use the notation x σ 1 ą σ 2y to express the claim that xstring (...) σ 1 is more random than string σ 2y. And, we take it to be intuitively clear that — on any plausible definition of such a relation — we should have S 1 ą S 2. (shrink)

mathematicians for over 60 years. Amazingly, the Argonne team's automated theorem-proving program EQP took only 8 days to find a proof of it. Unfortunately, the proof found by EQP is quite complex and difficult to follow. Some of the steps of the EQP proof require highly complex and unintuitive substitution strategies. As a result, it is nearly impossible to reconstruct or verify the computer proof of the Robbins conjecture entirely by hand. This is where the unique symbolic capabilities of Mathematica (...) 3 come in handy. With the help of Mathematica, it is relatively easy to work out and explain each step of the dense EQP proof in detail. In this paper, I use Mathematica to provide a detailed, step-by-step reconstruction of the highly complex EQP proof of the Robbins conjecture. (shrink)

With the inclusion of an e ective methodology, this article answers in detail a question that, for a quarter of a century, remained open despite intense study by various researchers. Is the formula XCB = e(x e(e(e(x y) e(z y)) z)) a single axiom for the classical equivalential calculus when the rules of inference consist of detachment (modus ponens) and substitution? Where the function e represents equivalence, this calculus can be axiomatized quite naturally with the formulas (x x), e(e(x y) (...) e(y x)), and e(e(x y) e(e(y z) e(x z))), which correspond to reexivity, symmetry, and transitivity, respectively. (We note that e(x x) is dependent on the other two axioms.) Heretofore, thirteen shortest single axioms for classical equivalence of length eleven had been discovered, and XCB was the only remaining formula of that length whose status was undetermined. To show that XCB is indeed such a single axiom, we focus on the rule of condensed detachment, a rule that captures detachment together with an appropriately general, but restricted, form of substitution. The proof we present in this paper consists of twenty- ve applications of condensed detachment, completing with the deduction of transitivity followed by a deduction of symmetry. We also discuss some factors that may explain in part why XCB resisted relinquishing its treasure for so long. Our approach relied on diverse strategies applied by the automated reasoning program OTTER. Thus ends the search for shortest single axioms for the equivalential calculus. (shrink)

The Jowett Society and the Philosophical Society of the University of Oxford provide a forum for discussion of philosophical issues for all members of the Philosophy Faculty. The Jowett society dates back to the 19th century and was named in honour of Benjamin Jowett..

By and large, we think Strevens’s [6] is a useful reply to our original critique [2] of his paper on the Quine–Duhem (QD) problem [5]. But, we remain unsatisfied with several aspects of his reply (and his original paper). Ultimately, we do not think he properly addresses our most important worries. In this brief rejoinder, we explain our remaining worries, and we issue a revised challenge for Strevens’s approach to QD.

In this paper, we compare and contrast two methods for the revision of qualitative beliefs. The first method is generated by a simplistic diachronic Lockean thesis requiring coherence with the agent’s posterior credences after conditionalization. The second method is the orthodox AGM approach to belief revision. Our primary aim is to determine when the two methods may disagree in their recommendations and when they must agree. We establish a number of novel results about their relative behavior. Our most notable finding (...) is that the inverse of the golden ratio emerges as a non-arbitrary bound on the Bayesian method’s free-parameter—the Lockean threshold. This “golden threshold” surfaces in two of our results and turns out to be crucial for understanding the relation between the two methods. (shrink)

Suppositions can be introduced in either the indicative or subjunctive mood. The introduction of either type of supposition initiates judgments that may be either qualitative, binary judgments about whether a given proposition is acceptable or quantitative, numerical ones about how acceptable it is. As such, accounts of qualitative/quantitative judgment under indicative/subjunctive supposition have been developed in the literature. We explore these four different types of theories by systematically explicating the relationships canonical representatives of each. Our representative qualitative accounts of indicative (...) and subjunctive supposition are based on the belief change operations provided by AGM revision and KM update respectively; our representative quantitative ones are offered by conditionalization and imaging. This choice is motivated by the familiar approach of understanding supposition as `provisional belief revision' wherein one temporarily treats the supposition as true and forms judgments by making appropriate changes to their other opinions. To compare the numerical judgments recommended by the quantitative theories with the binary ones recommended by the qualitative accounts, we rely on a suitably adapted version of the Lockean thesis. Ultimately, we establish a number of new results that we interpret as vindicating the often-repeated claim that conditionalization is a probabilistic version of revision, while imaging is a probabilistic version of update. (shrink)

Contemporary Bayesian confirmation theorists measure degree of (incremental) confirmation using a variety of non-equivalent relevance measures. As a result, a great many of the arguments surrounding quantitative Bayesian confirmation theory are implicitly sensitive to choice of measure of confirmation. Such arguments are enthymematic, since they tacitly presuppose that certain relevance measures should be used (for various purposes) rather than other relevance measures that have been proposed and defended in the philosophical literature. I present a survey of this pervasive class of (...) Bayesian confirmation-theoretic enthymemes, and a brief analysis of some recent attempts to resolve the problem of measure sensitivity. (shrink)

In Thinking and Acting John Pollock offers some criticisms of Bayesian epistemology, and he defends an alternative understanding of the role of probability in epistemology. Here, I defend the Bayesian against some of Pollock's criticisms, and I discuss a potential problem for Pollock's alternative account.

Naive deductivist accounts of confirmation have the undesirable consequence that if E confirms H, then E also confirms the conjunction H·X, for any X—even if X is completely irrelevant to E and H. Bayesian accounts of confirmation may appear to have the same problem. In a recent article in this journal Fitelson (2002) argued that existing Bayesian attempts to resolve of this problem are inadequate in several important respects. Fitelson then proposes a new‐and‐improved Bayesian account that overcomes the (...) problem of irrelevant conjunction, and does so in a more general setting than past attempts. We will show how to simplify and improve upon Fitelson's solution. (shrink)

Taking Joyce’s (1998; 2009) recent argument(s) for probabilism as our point of departure, we propose a new way of grounding formal, synchronic, epistemic coherence requirements for (opinionated) full belief. Our approach yields principled alternatives to deductive consistency, sheds new light on the preface and lottery paradoxes, and reveals novel conceptual connections between alethic and evidential epistemic norms.

In this paper, we show (among other things) that the conditional in Frege's Begriffsschrift is ambiguous.